-
1 алгоритм разбиения
Русско-английский словарь нормативно-технической терминологии > алгоритм разбиения
-
2 метод декомпозиции
алгоритм декомпозиции, алгоритм разложения, блочный алгоритм — decomposition algorithm
Русско-английский новый политехнический словарь > метод декомпозиции
-
3 алгоритм разложения
Economy: decomposition algorithmУниверсальный русско-английский словарь > алгоритм разложения
-
4 алгоритм LU-разложения
Русско-английский словарь по электронике > алгоритм LU-разложения
-
5 алгоритм LU-разложения
Русско-английский словарь по радиоэлектронике > алгоритм LU-разложения
-
6 алгоритм разбиения
1) Engineering: partitioning algorithm2) Information technology: divide-and-conquer algorithm3) Mechanics: decomposition algorithm4) Microelectronics: min-cut algorithm5) Robots: decomposition algorithm (напр. изображений), partitioning algorithm (напр. изображений)Универсальный русско-английский словарь > алгоритм разбиения
-
7 алгоритм декомпозиции
1) Economy: decomposition algorithm2) Information technology: divide-and-conquer algorithm3) Network technologies: partitioning algorithm4) Robots: decoupling algorithmУниверсальный русско-английский словарь > алгоритм декомпозиции
-
8 блочный алгоритм
1) Economy: decomposition algorithm2) Makarov: block algorithm -
9 алгоритм LU-разложения
Makarov: LU decomposition algorithm (в САПР)Универсальный русско-английский словарь > алгоритм LU-разложения
-
10 алгоритм разбора
Robots: decomposition algorithm (предложения) -
11 рекурсивное разбиение алгоритма
Programming: recursive decomposition in an algorithmУниверсальный русско-английский словарь > рекурсивное разбиение алгоритма
См. также в других словарях:
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
LU decomposition — In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as… … Wikipedia
Dantzig–Wolfe decomposition — is an algorithm for solving linear programming problems with special structure. It was originally developed by George Dantzig and Phil Wolfe and initially published in 1960[1]. Many texts on linear programming have sections dedicated to… … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Balancing domain decomposition — In numerical analysis, the balancing domain decomposition method (BDD) is an iterative method to find the solution of a symmetric positive definite system of linear algebraic equations arising from the finite element method J. Mandel, Balancing… … Wikipedia
Crout matrix decomposition — In linear algebra, the Crout matrix decomposition is an LU decomposition which decomposes a matrix into a lower triangular matrix (L), an upper triangular matrix (U) and, although not always needed, a permutation matrix (P). The Crout matrix… … Wikipedia
Cylindrical algebraic decomposition — Given a set of polynomials in Rn and a set S in Rn the Cylindrical algebraic decomposition algorithm finds a decomposition of S in to a number of cells such that for each cell each polynomial has constant sign. See also Quantifier elimination… … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
Cholesky decomposition — In linear algebra, the Cholesky decomposition or Cholesky triangle is a decomposition of a Hermitian, positive definite matrix into the product of a lower triangular matrix and its conjugate transpose. It was discovered by André Louis Cholesky… … Wikipedia
QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… … Wikipedia
Tree decomposition — A graph with eight vertices, and a tree decomposition of it onto a tree with six nodes. Each graph edge connects two vertices that are listed together at some tree node, and each graph vertex is listed at the nodes of a contiguous subtree of the… … Wikipedia